Polynomial equation solving by lifting procedures for ramified fibers
نویسندگان
چکیده
منابع مشابه
Solving Polynomial Systems Equation by Equation∗
By a numerical continuation method called a diagonal homotopy, one can compute the intersection of two irreducible positive dimensional solution sets of polynomial systems. This paper proposes to use this diagonal homotopy as the key step in a procedure to intersect general solution sets that are not necessarily irreducible or even equidimensional. Of particular interest is the special case whe...
متن کاملDeformation Techniques for Efficient Polynomial Equation Solving
Suppose we are given a parametric polynomial equation system encoded by an arithmetic circuit, which represents a generically flat and unramified family of zerodimensional algebraic varieties. Let us also assume that there is given the complete description of the solution of a particular unramified parameter instance of our system. We show that it is possible to ``move'' the given particular so...
متن کاملThe Hardness of Polynomial Equation Solving
Elimination theory is at the origin of algebraic geometry in the 19-th century and deals with algorithmic solving of multivariate polynomial equation systems over the complex numbers, or, more generally, over an arbitrary algebraically closed field. In this paper we investigate the intrinsic sequential time complexity of universal elimination procedures for arbitrary continuous data structures ...
متن کاملDegeneracy loci and polynomial equation solving
Let V be a smooth equidimensional quasi-affine variety of dimension r over C and let F be a (p× s)-matrix of coordinate functions of C[V ], where s ≥ p+ r. The pair (V, F ) determines a vector bundle E of rank s− p over W := {x ∈ V | rkF (x) = p}. We associate with (V, F ) a descending chain of degeneracy loci of E (the generic polar varieties of V represent a typical example of this situation)...
متن کاملStraight-line Programs in Polynomial Equation Solving
Solving symbolically polynomial equation systems when intermediate and final polynomials are represented in the usual dense encoding turns out to be very inefficient: the sizes of the systems one can deal with do not respond to realistic needs. Evaluation representations appeared in this frame a decade ago as a new possibility to treat new families of problems. We present a survey of the most r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.01.015